Pre-Run Prover Strategy Optimization
نویسنده
چکیده
Automated theorem provers use search strategies. Unfortunately, no strategy is uniformly successful on all problems. This motivates us to spend the available resources in terms of processors and time on diierent strategies. In this paper, we develop the basic concept of the complementarity of strategy sets. The problems of the initial strategy selection are discussed in detail. The paper also contains a short description of an implementation of a strategy parallel theorem prover (p-SETHEO) and an experimental evaluation of the schedule selection algorithm.
منابع مشابه
Strategy Selection by Genetic Programming
Strategy parallelism is a powerful concept for applying parMicUsm to automated theorem proving. One of the most important problems to be solved in this approach is the proper distribution of the available resources mnong the different strategies. This task usually requires a lot of user expertise. When the resource distribution has to be done automatically, an adaptive algorithm must be used to...
متن کاملCobalt: A Language for Writing Provably-Sound Compiler Optimizations
We overview the current status and future directions of the Cobalt project. Cobalt is a domainspecific language for implementing compiler optimizations as guarded rewrite rules. Cobalt optimizations operate over a C-like intermediate representation including unstructured control flow, pointers to local variables and dynamically allocated memory, and recursive procedures. The design of Cobalt en...
متن کاملDistributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover
The Distributed Larch Prover, DLP, is a distributed and parallel version of LP, an interactive prover. DLP helps users nd proofs by creating and managing many proof attempts that run in parallel. Parallel attempts may cooperate by working on diierent subgoals, and they may compete by using diierent inference methods to prove the same goal. DLP runs on a network of workstations.
متن کاملE-MaLeS 1.1
Picking the right search strategy is important for the success of automatic theorem provers. E-MaLeS is a meta-system that uses machine learning and strategy scheduling to optimize the performance of the first-order theorem prover E. E-MaLeS applies a kernel-based learning method to predict the run-time of a strategy on a given problem and dynamically constructs a schedule of multiple promising...
متن کاملSpecification and Verification of Graph-Based Model Transformation Properties
We extend a previously proposed symbolic model transformation property prover for the DSLTrans transformation language. The original prover generated the set of path conditions (i.e., symbolic transformation executions), and verified atomic contracts (constraints on inputoutput model relations) on these path conditions. The prover evaluated atomic contracts to yield either true or false for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007